Generalized Augmented Transition Network Grammars for Generation from Semantic Networks

نویسنده

  • Stuart C. Shapiro
چکیده

The augmented transition network (ATN) is a formalism for writing parsing grammars that has been much used in Artificial Intelligence and Computational Linguistics. A few researchers have also used ATNs for writing grammars for generating sentences. Previously , however, either generation ATNs did not have the same semantics as parsing ATNs, or they required an auxiliary mechanism to determine the syntactic structure of the sentence to be generated. This paper reports a generalization of the ATN formalism that allows ATN grammars to be written to parse labelled directed graphs. Specifically, an ATN grammar can be written to parse a semantic network and generate a surface string as its analysis. An example is given of a combined parsing-generating grammar that parses surface sentences, builds and queries a semantic network knowledge representation, and generates surface sentences in response.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genaralized Augmented Transition Network Grammars For Generation From Semantic Networks

Augmented transition network (ATN) grammars have, since their development by Woods [ 7; ~, become the most used method of describing grammars for natural language understanding end question answering systems. The advantages of the ATN notation have been su,naarized as "I) perspicuity, 2) generative power, 3) efficiency of representation, 4) the ability to capture linguistic regularities and gen...

متن کامل

TINA: A Natural Language System for Spoken Language Applications

A new natural language system, TINA, has been developed for applications involving spoken language tasks. TINA integrates key ideas from context free grammars, Augmented Transition Networks (ATN's), and the unification concept. TINA provides a seamless interface between syntactic and semantic analysis, and also produces a highly constraining probabilistic language model to improve recognition p...

متن کامل

Computational Linguistics

The use of augmented transition network grammars for the analysis of natural language sentences is described. Structure-building actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deep-structure representations of the type normally obtained from a transformational analysis, and conditions on the arcs ...

متن کامل

Generation Of Synthes Is Programs In Robra (Ariane) From String-Tree Correspondence Grammars (or a Strategy for Synthesis in Machine Translation)

Specialised Languages for Linguistic Programming, or SLLPs (like ROBRA, Osystems, Augmented Transition Networks, etc.), in Machine Translation (MT) systems may be considerably efficient in terms of processing power, but its procedural nature makes it quite difficult for linguists to describe natural languages in a declarative and natural way. Furthermore, the effort can be quite wasteful in the...

متن کامل

Comit ==* Patr Ii

Here is the history of linguistics in one sentence: once upon a time linguists (i.e. syntacticlans) used augmented phrase structure grammars, then they went over to transformational grammars, and then some of them started using augmented phrase structure grammars again, (space for moral~. Whilst we are in this careful scholarly mode, let us do the same service for computational linguistics: onc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • American Journal of Computational Linguistics

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1979